Sharing Loading Costs for Multi Compartment Vehicles
نویسندگان
چکیده
منابع مشابه
Electric-vehicle car-sharing in one-way car-sharing systems considering depreciation costs of vehicles and chargers
In recent years, car-sharing systems have been announced as a way to increase mobility and to decrease the number of single-occupant vehicles, congestion, and air pollution in many parts of the world. This study presents a linear programming model to optimize one-way car-sharing systems for electric cars considering the depreciation costs of chargers and vehicles as well as relocation cost of v...
متن کاملDiscrete and dynamic versus continuous and static loading policy for a multi-compartment vehicle
In this paper, we address the problem of loading non-intermixable products in a vehicle consisting of compartments of different sizes. The demands of the products are different but uniform over time. The objective is to meet product demands and minimize setup rate (that is, the number of deliveries per unit time). Two approaches, namely, dynamic and static, are investigated and their performanc...
متن کاملA Model for Sharing the Costs of Uncontrollable Risks among Contracting Parties
The allocation of risks among the contracting parties in a contract is an important decision affecting the project success. Some risks in a project are uncontrollable; these are imposed to a project by external factors. Since contracting parties can neither control nor affect the occurrence of such risks, their allocation to a party would be inequitable. Therefore the cost overrun related to un...
متن کاملSharing Supermodular Costs
We study cooperative games with supermodular costs. We show that supermodular costs arise in a variety of situations; in particular, we show that the problem of minimizing a linear function over a supermodular polyhedron—a problem that often arises in combinatorial optimization—has supermodular optimal costs. In addition, we examine the computational complexity of the least core and least core ...
متن کاملSharing Costs for Better Selfish Network Design
We consider how to design network cost-sharing protocols to induce benign selfish behavior in large networks. We study this issue in network cost-sharing games, where the set of Nash equilibria depends fundamentally on the choice of the underlying edge cost-sharing protocols. We seek cost-sharing protocols that minimize the inefficiency of equilibria in the resulting network design game, as mea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Games
سال: 2018
ISSN: 2073-4336
DOI: 10.3390/g9020025